X iv : m at h . C O / 0 60 25 73 v 1 2 5 Fe b 20 06 The Forest Metric for Graph Vertices ⋆
نویسنده
چکیده
We propose a new graph metric and study its properties. In contrast to the standard distance in connected graphs [5], it takes into account all paths between vertices. Formally, it is defined as d(i, j) = qii+qjj−qij−qji [11], where qij is the (i, j)-entry of the relative forest accessibility matrix Q(ε) = (I + εL)−1, L is the Laplacian matrix of the (weighted) (multi)graph, and ε is a positive parameter. By the matrix-forest theorem, the (i, j)-entry of the relative forest accessibility matrix of a graph provides the specific number of spanning rooted forests such that i and j belong to the same tree rooted at i. Extremely simple formulas express the modification of the proposed distance under the basic graph transformations. We give a topological interpretation of d(i, j) in terms of the probability of unsuccessful linking i and j in a model of random links. The properties of this metric are compared with those of some other graph metrics [13,1]. An application of this metric is related to clustering procedures such as centered partition [2]. In another procedure, the relative forest accessibility and the corresponding distance serve to choose the centers of the clusters and to assign a cluster to each non-central vertex. Some related geometric representations are discussed in [3]. The notion of cumulative weight of connections between two vertices is proposed. The reasoning involves a reciprocity principle for weighted multigraphs. Connections between the resistance distance and the forest distances are established.
منابع مشابه
The metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کاملar X iv : m at h / 06 08 73 5 v 1 [ m at h . C O ] 2 9 A ug 2 00 6 SUFFICIENT CONDITIONS FOR LABELLED 0 – 1 LAWS
Exponentiating a power series can have the effect of smoothing out the behavior of the coefficients. In this paper we look at conditions on the growth of the coefficients of G(x) = ∑ g(n)x, where g(n) ≥ 0, which ensure that f(n−1)/f(n)→ ∞, where F(x) = e. Useful notation will be f(n) ≺ g(n) for f(n) eventually less than g(n) and f(n) ∈ RT∞ for f(n− 1)/f(n) → ∞; the notation RT stands for the ra...
متن کاملar X iv : 0 80 1 . 06 58 v 1 [ m at h . C O ] 4 J an 2 00 8 On Potentially 3 - regular graph graphic Sequences ∗
For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. In this paper, we characterize the potentially Hgraphic sequences where H denotes 3-regular graph with 6 vertices. In other words, we characterize the potentially K3,3 and K6 − C6graphic sequences where Kr,r is an r × r complete bipa...
متن کاملar X iv : m at h / 06 02 64 2 v 1 [ m at h . A G ] 2 8 Fe b 20 06 DIVISOR CLASSES AND THE VIRTUAL CANONICAL BUNDLE FOR GENUS 0 MAPS
Some divisor class relations for genus 0 curves are proved and used to compute the Cartier divisor class of the virtual canonical bundle for genus 0 maps to a smooth target. Many results here first appeared in [6] and [5]; our proofs use a completely different method.
متن کامل